Verifying computations without reexecuting them
نویسندگان
چکیده
منابع مشابه
Verifying computations without reexecuting them: from theoretical possibility to near-practicality
How can a single PC check a herd of supercomputers with unreliable software and untested hardware? This classic problem is particularly relevant today, as much computation is now outsourced: it is performed by machines that are rented, remote, or both. For example, service providers (SPs) now offer storage, computation, managed desktops, and more. As a result, relatively weak devices (phones, t...
متن کاملVerifying Massively Data Parallel Multi-Stage Computations
Data parallel, multi-stage computations occurring on a massive scale are difficult to verify. With the recent advent of various parallel computing platforms [2, 4], and the resultant increased availability and accessibility of significant computational resources at a relatively economical price, more and more users are going to take advantage of the computational resources offered by the cloud ...
متن کاملVerifying computations with state (extended version)*
When a client outsources a job to a third party (e.g., the cloud), how can the client check the result, without reexecuting the computation? Recent work in proof-based verifiable computation has made significant progress on this problem by incorporating deep results from complexity theory and cryptography into built systems. However, these systems work within a stateless model: they exclude com...
متن کاملVerifying Computations with Streaming Interactive Proofs
When computation is outsourced, the data owner would like to be assured that the desired computation has been performed correctly by the service provider. In theory, proof systems can give the necessary assurance, but prior work is not sufficiently scalable or practical. In this paper, we develop new proof protocols for verifying computations which are streaming in nature: the verifier (data ow...
متن کاملShape computations without compositions
Parametric CAD supports design explorations through generative methods which compose and transform geometric elements. This paper argues that elementary shape computations do not always correspond to valid compositional shape structures. In many design cases generative rules correspond to compositional structures, but for relatively simple shapes and rules it is not always possible to assign a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications of the ACM
سال: 2015
ISSN: 0001-0782,1557-7317
DOI: 10.1145/2641562